A Rough Set Approach to Compute All MaximalGeneralized Rules in Relational Databases
نویسندگان
چکیده
Database stores a huge amount of information in a structured and organized manner and provides many features for machine learning. There are a lot of algorithms to discover diierent kinds of rules from databases. In this paper, we propose a new method which can compute all maximal generalized rules in relational databases. The method integrates the machine learning paradigm, especially learning-from-examples techniques, with rough-set techniques. An attribute-oriented concept tree ascension technique is rst applied in generalization, which substantially reduces the computational complexity of database learning processes. Then the decision matrices are constructed from the generalized relation and the maximal generalized rules with non-necessary constraints can be learned.
منابع مشابه
Learning in Relational Databases: A Rough Set Approach
Knowledge discovery in databases, or data mining, is an important direction in the development of data and knowledge-based systems. Because of the huge amount of data stored in large numbers of existing databases, and because the amount of data generated in electronic forms is growing rapidly, it is necessary to develop efficient methods to extract knowledge from databases. An attribute-oriente...
متن کاملDistributed Incremental Data Mining from Very Large Databases: A Rough Multiset Approach
This paper presents a mechanism for developing distributed learners for learning production rules from massive, dynamic, and distributed databases. The task of distributed learning is formulated by the concept of multiset decision tables that is based on rough multisets and information multisystems, which are derived from the theory of rough sets. We use the concept of partition of boundary set...
متن کاملLearning Rules from Very Large Databases Using Rough Multisets
This paper presents a mechanism called LERS-M for learning production rules from very large databases. It can be implemented using objectrelational database systems, it can be used for distributed data mining, and it has a structure that matches well with parallel processing. LERS-M is based on rough multisets and it is formulated using relational operations with the objective to be tightly cou...
متن کاملDBROUGH: A Rough Set Based Knowledge Discovery System
Abs t rac t . Knowledge discovery in databases, or data mining, is an important objective in the development of dataand knowledge-base systems. An attributeoriented rough set method is developed for knowledge discovery in databases. The method integrates learning from example techniques with rough set theory. An attribute-oriented concept tree ascension technique is first applied in generalizat...
متن کاملApplication of Rough Set Theory in Data Mining for Decision Support Systems (DSSs)
Decision support systems (DSSs) are prevalent information systems for decision making in many competitive business environments. In a DSS, decision making process is intimately related to some factors which determine the quality of information systems and their related products. Traditional approaches to data analysis usually cannot be implemented in sophisticated Companies, where managers ne...
متن کامل